Homogeneous and strictly homogeneous criteria for partial structures
نویسندگان
چکیده
منابع مشابه
Countable homogeneous and partially homogeneous ordered structures
I survey classification results for countable homogeneous or ‘partially homogeneous’ ordered structures. This includes some account of Schmerl’s classification of the countable homogeneous partial orders, outlining an extension of this to the coloured case, and also treating results on linear orders, and their generalizations, trees and cycle-free partial orders. 2000 Mathematics Subject Classi...
متن کاملHomogeneous Structures
A relational first order structure is homogeneous if every isomorphism between finite substructures extends to an automorphism. Familiar examples of such structures include the rational numbers with the usual order relation, the countable random and so called Rado graph, and many others. Countable homogeneous structures arise as Fraı̈ssé limits of amalgamation classes of finite structures, and h...
متن کاملHomogeneous structures, . . .
I aim to give the flavour of a selection of topics based around Fräıssé’s notion of homogeneous structure. This is an area connecting ideas from model theory, permutation group theory, combinatorics, descriptive set theory, complexity theory, and other subjects. I will touch superficially a number of these subjects, with little in depth. The background assumed will be basic first order logic (l...
متن کاملHomogeneous Clifford structures
We give an upper bound for the rank r of homogeneous (even) Clifford structures on compact manifolds of non-vanishing Euler characteristic. More precisely, we show that if r = 2 · b with b odd, then r ≤ 9 for a = 0, r ≤ 10 for a = 1, r ≤ 12 for a = 2 and r ≤ 16 for a ≥ 3. Moreover, we describe the four limiting cases and show that there is exactly one solution in each case. 2010 Mathematics Sub...
متن کاملIsomorphism of Homogeneous Structures
We consider the complexity of the isomorphism relation on countable first-order structures with transitive automorphism groups. We use the theory of Borel reducibility of equivalence relations to show that the isomorphism problem for vertex-transitive graphs is as complicated as the isomorphism problem for arbitrary graphs, and determine for which first-order languages the isomorphism problem f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.07.012